Faster deterministic integer factorization
نویسندگان
چکیده
The best known unconditional deterministic complexity bound for computing the prime factorization of an integer N is O(Mint(N 1/4 logN)), where Mint(k) denotes the cost of multiplying k-bit integers. This result is due to Bostan–Gaudry–Schost, following the Pollard–Strassen approach. We show that this bound can be improved by a factor of √
منابع مشابه
On the WZ Factorization of the Real and Integer Matrices
The textit{QIF} (Quadrant Interlocking Factorization) method of Evans and Hatzopoulos solves linear equation systems using textit{WZ} factorization. The WZ factorization can be faster than the textit{LU} factorization because, it performs the simultaneous evaluation of two columns or two rows. Here, we present a method for computing the real and integer textit{WZ} and textit{ZW} factoriz...
متن کاملOn the Complexity of Integer Factorization
This note presents a deterministic integer factorization algorithm based on a system of polynomials equations. This technique exploits a new idea in the construction of irreducible polynomials with parametized roots, and recent advances in polynomial lattices reduction methods. The main result establishes a new deterministic time complexity bench mark. 1 Introduction This note presents a determ...
متن کاملDeterministic Integer Factorization Algorithms
This note presents a deterministic integer factorization algorithm of running time complexity O(N), ε > 0. This improves the current performances of deterministic integer factorization algorithms rated at O(N) arithmetic operations. Equivalently, given the least (log N)/6 bits of a factor of N = pq, where p and q are primes, the algorithm factors the integer in polynomial time O(log(N)), c ≥ 0 ...
متن کامل6 J ul 2 01 7 A BABYSTEP - GIANTSTEP METHOD FOR FASTER DETERMINISTIC INTEGER
In 1977, Strassen presented a deterministic and rigorous algorithm for solving the problem of computing the prime factorization of natural numbers N . His method is based on fast polynomial arithmetic techniques and runs in time Õ(N1/4), which has been state of the art for the last forty years. In this paper, we will combine Strassen’s approach with a babystep-giantstep method to improve the cu...
متن کاملOn the Deterministic Complexity of Factoring Polynomials over Finite Fields
We present a new deterministic algorithm for factoring polynomials over Z p of degree n. We show that the worst-case running time of our algorithm is O(p 1=2 (log p) 2 n 2+), which is faster than the running times of previous deterministic algorithms with respect to both n and p. We also show that our algorithm runs in polynomial time for all but at most an exponentially small fraction of the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Math. Comput.
دوره 83 شماره
صفحات -
تاریخ انتشار 2014